Predication Graphs as Canonical Representation of Query Sentences

نویسندگان

  • Timo Honkela
  • Aarno Lehtola
  • K. Valkonen
چکیده

This paper surveys problems encountered in studying the logico-semantic form and discourse problems of Finnish query sentences. W e ca ll the logico-semantic form a predication graph. The basic framework we use to represent the logica l form of Finnish query sentences is an annotated logical tree transformed from the dependency parse tree using graph transformations of the AWARE-system. Examples of analysing e l l i p t i c and anaphoric expressions are given. Finally, some c r it ic a l points of computational semantics are discussed. 1 CANONICAL STRUCTURE One of the main objectives of the logico-semantic level is to give those utterances that d iffe r only syntactically a uniform representation. This representation is a predication structure with predicates and their arguments. For example, the expressions "v a ltio t, iotka tuottavat laivoja" (countries that produce vessels) and "laivola tuottavat v a ltiot" (countries producing vessels) would lead into a single logico-semantic form something like as follow s: PRODUCE C O U NT RY PL VESSEL PL The arguments are kind of typed variables. The expression could also be stated: produce(X,Y) and country(X) and vessel(Y). An argument may further be another predication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical representation for approximating solution of fuzzy polynomial equations

In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness. 

متن کامل

Canonical Varieties with No Canonical Axiomatisation

We give a simple example of a variety V of modal algebras that is canonical but cannot be axiomatised by canonical equations or first-order sentences. We then show that the variety RRA of representable relation algebras, although canonical, has no canonical axiomatisation. Indeed, we show that every axiomatisation of these varieties involves infinitely many noncanonical sentences. Using probabi...

متن کامل

consider Sentences Reconsidered in the Light of Greek Evidence

English sentences such as I consider John smart have long presented analytic ambiguity between a “small clause” analysis and a “predication” analysis, and the apparently equivalent sentence-type in Greek, e.g. presents similar problems. Here it is argued that additional evidence from each language, involving constructions that are sensitive to the thematicity of an object NP, shows that these s...

متن کامل

Building Parameterized Canonical Representations to Achieve Interoperability among Heterogeneous Databases

This paper describes a technique to support interoperable query processing when multiple heterogeneous databases are accessed. We focus on the problem of supporting query transformation transparently , so a user can pose queries locally, without any need of global knowledge about diierent data models and schemas. To support interoperable query transformation, we need to resolve the connicts (i....

متن کامل

MUDOS-NG: Multi-document Summaries Using N-gram Graphs (Tech Report)

This report describes the MUDOS-NG summarization system, which applies a set of language-independent and generic methods for generating extractive summaries. The proposed methods are mostly combinations of simple operators on a generic character n-gram graph representation of texts. This work defines the set of used operators upon n-gram graphs and proposes using these operators within the mult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988